Transitive Subgroups of Primitive Permutation Groups

Transitive Permutation Groups without Semiregular Subgroups

A transitive finite permutation group is called elusive if it contains no nontrivial semiregular subgroup. The purpose of the paper is to collect known information about elusive groups. The main results are recursive constructions of elusive permutation groups, using various product operations and affine group constructions. A brief historical introduction and a survey of known elusive groups a...

Doubly Transitive but Not Doubly Primitive Permutation Groups

The connection between doubly transitive permutation groups G on a finite set Cl which are not doubly primitive and automorphism groups of block designs in which X = 1 has been investigated by Sims [2] and Atkinson [1]. If, for a e Q, Ga has a set of imprimitivity of size 2 then it is easy to show that G is either sharply doubly transitive or is a group of automorphisms of a non-trivial block d...

Doubly Transitive Permutation Groups Which Are Not Doubly Primitive

Hypothesis (A): G is a doubly transitive permutation group on a set Q. For 01 E Q, G, has a set Z = {B, , B, ,..., B,}, t > 2, which is a complete set of imprimitivity blocks on Q {a}. Let j Bi / = b > 1 for all i. Denote by H the kernel of G, on .Z and by Ki and K< the subgroups of G, fixing Bi setwise and pointwise respectively, 1 .< i < t. Let /3 E Bl . Here j Q j = 1 + ht. M. D. Atkinson ha...

On Transitive Permutation Groups

We assign names and new generators to the transitive groups of degree up to 15, reflecting their structure.

Generating Transitive Permutation Groups